منابع مشابه
Full domination in graphs
For each vertex v in a graph G, let there be associated a subgraph Hv of G. The vertex v is said to dominate Hv as well as dominate each vertex and edge of Hv. A set S of vertices of G is called a full dominating set if every vertex of G is dominated by some vertex of S, as is every edge of G. The minimum cardinality of a full dominating set of G is its full domination number γFH(G). A full dom...
متن کاملSequentialization for full N-Graphs via sub-N-Graphs
Since proof-nets for MLL− were introduced by Girard (1987), several studies have appeared dealing with its soundness proof. Bellin & Van de Wiele (1995) produced an elegant proof based on properties of subnets (empires and kingdoms) and Robinson (2003) proposed a straightforward generalization of this presentation for proof-nets from sequent calculus for classical logic. In 2014 it was presente...
متن کاملFull friendly index sets of cylinder graphs
Let G = (V,E) be a connected simple graph. A labeling f : V → Z2 induces an edge labeling f : E → Z2 defined by f(xy) = f(x) + f(y) for each xy ∈ E. For i ∈ Z2, let vf (i) = |f−1(i)| and ef(i) = |(f+)−1(i)|. A labeling f is called friendly if |vf (1) − vf(0)| ≤ 1. For a friendly labeling f of a graph G, we define the friendly index of G under f by if(G) = ef (1) − ef(0). The set {if(G) | f is a...
متن کاملDomatically critical and domatically full graphs
A subset, D, of the vertex set of a graph G is called a dominating set of G if each vertex of G is either in D or adjacent to some vertex in D. The maximum cardinality of a partition of the vertex set of G into dominating sets is the domatic number of G, denoted d(G). G is said to be domatically critical if the removal of any edge of G decreases the domatic number, and G is domatically full if ...
متن کاملClique-width of full bubble model graphs
A bubble model is a 2-dimensional representation of proper interval graphs. We consider proper interval graphs that have bubble models of specific properties. We characterise the maximal such proper interval graphs of bounded clique-width and of bounded linear cliquewidth and the minimal such proper interval graphs whose clique-width and linear cliquewidth exceed the bounds. As a consequence, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1996
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00134-y